Derived Trees Evolution for Tree Adjoining Grammars Parsing

نویسندگان

  • Adrian-Horia Dediu
  • Carlos Martín-Vide
چکیده

Starting from the model proposed by means of Grammatical Evolution, we extended the applicability of the parallel and cooperative searching processes of Evolutionary Algorithms to a new topic, Tree Adjoining Grammars parsing. We evolved derived trees using a string-tree-representation. We also could use a linear matching function to compare the yield of a derived tree with a given input and the running tests present several encouraging results. Due to the higher degree of intrinsic parallelism Evolutionary Algorithms represent a new alternative to the highly complex classical methods used in Formal Computational Models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parsing Tree Adjoining Grammars using Evolutionary Algorithms

We use evolutionary algorithms to speed up a rather complex process, the tree adjoining grammars parsing. This improvement is due due to a linear matching function which compares the fitness of different individuals. Internally, derived trees are processed as tree-to-string representations. Moreover, we present some practical results and a post running analysis that may encourage the use of evo...

متن کامل

Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions

A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsi...

متن کامل

Weighted parsing of trees

We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.

متن کامل

From Treebanks to Tree-Adjoining Grammars

Grammars are valuable resources for natural language processing. A large-scale grammar may incorporate a vast amount of information on morphology, syntax, and semantics. Traditionally, grammars are built manually. Hand-crafted grammars often contain rich information, but require tremendous human effort to build and maintain. As large-scale treebanks become available in the last decade, there ha...

متن کامل

XTAG - A Graphical Workbench for Developing Tree-Adjoining Grammars

We describe a workbench (XTAG) for the development of tree-adjoining grammars and their parsers, and discuss some issues that arise in the design of the graphical interface. Contrary to string rewriting grammars generating trees, the elementary objects manipulated by a tree-adjoining grammar are extended trees (i.e. trees of depth one or more) which capture syntactic information of lexical item...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Grammars

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2004